EAR: An Environment-Adaptive Routing Algorithm for WBANs
نویسندگان
چکیده
A wireless body area network (WBAN) is constructed in the vicinity of a human body and provides various services for both medical and non-medical services. In order to provide monitoring services for medical devices, routing algorithms for wireless sensor networks (WSN) have been considered for WBANs. However, unlike WSNs, which consist of homogeneous devices, WBANs are organized with heterogeneous devices having different characteristics. Thus, directly applying routing algorithms for WSNs to WBANs is inefficient. This paper proposes a routing algorithm for WBANs. The proposed routing algorithm considers different communication costs for heterogeneous WBAN devices, and avoids faulty relay nodes for reliable transmission.
منابع مشابه
A hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملA Reliable Routing Algorithm for Delay Sensitive Data in Body Area Networks
Wireless body Area networks (WBANs) include a number of sensor nodes placed inside or on the human body to improve patient health and quality of life. Ensuring the transfer and receipt of data in sensitive data is a very important issue. Routing algorithms should support a variety of service quality such as reliability and delay in sending and receiving data. Loss of information or excessive da...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کامل